A Generating Algorithm for Ribbon Tableaux and Spin Polynomials
نویسنده
چکیده
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it permits one to generate ribbon tableaux with skew shapes.
منابع مشابه
Distributed Computation of Ribbon Tableaux and Spin Polynominals
Recent works in algebraic combinatorics have brought up to date the importance of certain planar structures, called ribbon tableaux, which are generalizations of Young tableaux. This paper gives an algorithm to eeciently distribute, using PVM, the computation of the set of all ribbon tableaux of given shape and weight. It also provides a way to compute the spin polynomials associated to those s...
متن کاملDual equivalence graphs, ribbon tableaux and Macdonald polynomials
We make a systematic study of a new combinatorial construction called a dual equivalence graph. Motivated by the dual equivalence relation on standard Young tableaux introduced by Haiman, we axiomatize such constructions and prove that the generating functions of these graphs are Schur positive. We construct a graph on k-ribbon tableaux which we conjecture to be a dual equivalence graph, and we...
متن کاملA Cyclage Poset Structure for Littlewood-Richardson Tableaux
A graded poset structure is defined for the sets of LittlewoodRichardson (LR) tableaux that count the multiplicity of an irreducible gl(n)module in the tensor product of irreducible gl(n)-modules corresponding to rectangular partitions. This poset generalizes the cyclage poset on columnstrict tableaux defined by Lascoux and Schützenberger, and its grading function generalizes the charge statist...
متن کاملDual Equivalence Graphs and a Combinatorial Proof of Llt and Macdonald Positivity
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon tableaux which we transform into a dual equivalence graph, we give a combinatorial proof of the symmetry and Schur positivity of the ribbon tableaux generating func...
متن کاملar X iv : 0 70 9 . 09 71 v 1 [ m at h . C O ] 6 S ep 2 00 7 k - RIBBON FIBONACCI TABLEAUX
We extend the notion of k-ribbon tableaux to the Fibonacci lattice, a differential poset defined by R. Stanley in 1975. Using this notion, we describe an insertion algorithm that takes k-colored permutations to pairs of k-ribbon Fibonacci tableaux of the same shape, and we demonstrate a colorto-spin property, similar to that described by Shimozono and White for ribbon tableaux. We give an evacu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2007